#include<bits/stdc++.h>
using namespace std;
int n;
int a[100005];
//int lc=0,lr=-1;
//int eq;
queue<int> l;
int fr;
int ans=0;

int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }

    sort(a+1,a+n+1);

    l.push(a[1]);
    for(int i=2;i<=n;i++){
        fr=l.front();
        if(a[i]>fr){
            l.pop();
            l.push(a[i]);
        }else if(a[i]==fr){
            l.push(a[i]);
        }
    }

    while(l.empty()==0){
        ans++;
        l.pop();
    }

    cout<<ans;

    return 0;
}
